Filtering directory lookups in CMPs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of Low-Overhead Organizations for the Directory in Future Many-Core CMPs

If current trends continue, today’s small-scale general-purpose CMPs will soon be replaced by multi-core architectures integrating tens or even hundreds of cores on-chip. Most likely, some of these many-core CMPs will implement the hardware-managed, implicitly-addressed, coherent caches memory model. Cache coherence in these designs will be probably maintained through a directory-based cache co...

متن کامل

Characterization of a List-Based Directory Cache Coherence Protocol for Manycore CMPs

The development of efficient and scalable cache coherence protocols is a key aspect in the design of manycore chip multiprocessors. In this work, we review a kind of cache coherence protocols that, despite having been already implemented in the 90s for building large-scale commodity multiprocessors, have not been seriously considered in the current context of chip multiprocessors. In particular...

متن کامل

Dual Lookups in Pattern Databases

A pattern database (PDB) is a heuristic function stored as a lookup table. Symmetries of a state space are often used to enable multiple values to be looked up in a PDB for a given state. This paper introduces an additional PDB lookup, called the dual PDB lookup. A dual PDB lookup is always admissible but can return inconsistent values. The paper also presents an extension of the well-known pat...

متن کامل

Filtering of Unnecessary Branch Predictor Lookups for Low-power Processor Architecture

Efforts to reduce power consumption of processors have gained much attention recently. Dynamic branch predictor, including BTB, is exercised in every instruction cycle, yet branch instructions only constitute a small percentage of instructions during program execution. This study proposes a novel method to collect the next branch distances of the recent branch instructions at runtime, in order ...

متن کامل

Efficient Caching for IP Lookups

IP address lookups form a critical component of the internet routing infrastructure. Typically based on trie-based structures and related extensions, the problem has several similarities to other applications of dictionaries in data compression, information retrieval, etc. The extreme need for speed in IP lookups has prompted considerable research in development of appropriate data structures, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Microprocessors and Microsystems

سال: 2011

ISSN: 0141-9331

DOI: 10.1016/j.micpro.2011.08.006